Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
x * (minus(y) * y) |
→ minus(y * y) * x |
|
There are 2 dependency pairs:
|
| 2: |
|
x *# (minus(y) * y) |
→ minus(y * y) *# x |
| 3: |
|
x *# (minus(y) * y) |
→ y *# y |
|
Consider the SCC {2,3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 3, 2006